Factorizing Equivalent Variable Pairs inROBDD -
نویسندگان
چکیده
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitable domain for capturing the kind of dependencies arising in groundness analysis, and Reduced Ordered Binary Decision Diagrams (ROBDDs) are generally accepted to be the most eecient representation for Pos. Unfortunately, the size of an ROBDDs is, in the worst case, exponential in the number of variables it depends upon. Earlier work 2] has shown that a hybrid representation that separates the deenite information from the dependency information is considerably more eecient than keeping the two together. The aim of the present paper is to push this idea further, also separating out certain dependency information, in particular all pairs of variables that are always either both ground or neither ground. We nd that this new hybrid representation is a signiicant improvement over previous work.
منابع مشابه
Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitable domain for capturing the kind of dependencies arising in groundness analysis, and Reduced Ordered Binary Decision Diagrams (ROBDDs) are generally accepted to be the most efficient representation for Pos. Unfortunatel...
متن کاملGraph-Based Factorization of Classical Planning Problems
In domain-independent planning, dependencies of operators and variables often prevent the effective application of planning techniques that rely on “loosely coupled” problems (like factored planning or partial order reduction). In this paper, we propose a generic approach for factorizing a classical planning problem into an equivalent problem with fewer operator and variable dependencies. Our a...
متن کاملBounds for Tree Automata with Polynomial Costs
We consider tree automata with costs over semirings in the sense of (Seidl, 1994). We de ne the concept of a nitely factorizing semiring and of a monotonic semiring, both as the generalization of well-known particular semirings, and show that the costniteness of tree automata with costs over nitely factorizing and monotonic semirings is decidable. We show that, for tree automata with costs over...
متن کاملBounds for Tree Automata with Polynomial Costs1
We consider tree automata with costs over semirings in the sense of (Seidl, 1994). We define the concept of a finitely factorizing semiring and of a monotonic semiring, both as the generalization of well-known particular semirings, and show that the costfiniteness of tree automata with costs over finitely factorizing and monotonic semirings is decidable. We show that, for tree automata with cos...
متن کاملOn some factorization problems
We consider three notions of factorization arising in different frameworks: factorizing languages, factorization of the natural numbers, factorizing codes. A language X ⊆ A∗ is called factorizing if there exists a language Y ⊆ A∗ such that XY = A∗ and the product is unambiguous. This is a decidable property for recognizable languages X . If we consider the particular case of unary alphabets, we...
متن کامل